Process Algebra with Iteration and Nesting

Process Algebra with Iteration

We introduce iteration in process algebra by means of (the binary version of) Kleene's star operator: x y is the process that chooses between x and y, and upon termination of x has this choice again. It is proved that adding respectively interleaving, communication and abstraction operators increases expressivity up to the regular processes. However, if the distinction between (successful) term...

Basic Process Algebra with Iteration: Completeness of its Equational Axioms

Bergstra, Bethke and Ponse proposed an axiomatization for Basic Process Algebra extended with (binary) iteration. In this paper, we prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we will set up a term rewriting system, based on the axioms, and prove that this term rewriting system is terminating, and that bisimilar normal forms...

Kleene Algebra with Products and Iteration Theories

We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra in a common framework. Our approach is based on cartesian categories endowed with commutative strong monads to handle nondeterminism. 1998 ACM Subject Classification F.3.1 Specifying and Verifying and Reasoning about Programs

Two Recursive Generalizations of Iteration in Process Algebra

Hidden-Markov Program Algebra with iteration

We use Hidden Markov Models to motivate a quantitative composi-tional semantics for noninterference-based security with iteration, includ-ing a refinementor “implements” relation that compares two programswith respect to their information leakage; and we propose a program al-gebra for source-level reasoning about such programs, in particular as ameans of establishing that an...